Nash Equilibrium in Graphical Games and Stochastic Graphical Games
نویسنده
چکیده
In this paper, graphical games, a compact graphical representation for multi-player game theory is introduced. Various Nash equilibrium computing algorithms for graphical games are reviewed and a naive join tree base approximate Nash equilibrium computing algorithm is proposed. The proposed algorithm can be efficiently used in graphical games with arbitrary underlying structure. Graphical representation of multi-player stochastic games is also discussed as an extension of graphical games in this paper.
منابع مشابه
Tractable Algorithms for Approximate Nash Equilibria in Generalized Graphical Games with Tree Structure
We provide the first fully polynomial time approximation scheme (FPTAS) for computing an approximate mixedstrategy Nash equilibrium in graphical multi-hypermatrix games (GMhGs), which are generalizations of normal-form games, graphical games, graphical polymatrix games, and hypergraphical games. Computing an exact mixed-strategy Nash equilibria in graphical polymatrix games is PPADcomplete and ...
متن کاملAn Efficient, Exact Algorithm for Solving Tree-Structured Graphical Games
We describe a new algorithm for computing a Nash equilibrium in graphical games, a compact representation for multi-agent systems that we introduced in previous work. The algorithm is the first to compute equilibria both efficiently and exactly for a non-trivial class of graphical games.
متن کاملBounding the Uncertainty of Graphical Games: The Complexity of Simple Requirements, Pareto and Strong Nash Equilibria
We investigate the complexity of bounding the uncertainty of graphical games, and we provide new insight into the intrinsic difficulty of computing Nash equilibria. In particular, we show that, if one adds very simple and natural additional requirements to a graphical game, the existence of Nash equilibria is no longer guaranteed, and computing an equilibrium is an intractable problem. Moreover...
متن کاملFPTAS for Mixed-Strategy Nash Equilibria in Tree Graphical Games and Their Generalizations
We provide the first fully polynomial time approximation scheme (FPTAS) for computing an approximate mixed-strategy Nash equilibrium in tree-structured graphical multi-hypermatrix games (GMhGs). GMhGs are generalizations of normal-form games, graphical games, graphical polymatrix games, and hypergraphical games. Computing an exact mixed-strategy Nash equilibria in graphical polymatrix games is ...
متن کاملOn Sparse Discretization for Graphical Games
This short paper concerns discretization schemes for representing and computing approximate Nash equilibria, with emphasis on graphical games, but briefly touching on normal-form and poly-matrix games. The main technical contribution is a representation theorem that informally states that to account for every exact Nash equilibrium using a nearby approximate Nash equilibrium on a grid over mixe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004